//You are given an integer array coins representing coins of different 
//denominations and an integer amount representing a total amount of money. 
//
// Return the fewest number of coins that you need to make up that amount. If 
//that amount of money cannot be made up by any combination of the coins, return -1.
// 
//
// You may assume that you have an infinite number of each kind of coin. 
//
// 
// Example 1: 
//
// 
//Input: coins = [1,2,5], amount = 11
//Output: 3
//Explanation: 11 = 5 + 5 + 1
// 
//
// Example 2: 
//
// 
//Input: coins = [2], amount = 3
//Output: -1
// 
//
// Example 3: 
//
// 
//Input: coins = [1], amount = 0
//Output: 0
// 
//
// Example 4: 
//
// 
//Input: coins = [1], amount = 1
//Output: 1
// 
//
// Example 5: 
//
// 
//Input: coins = [1], amount = 2
//Output: 2
// 
//
// 
// Constraints: 
//
// 
// 1 <= coins.length <= 12 
// 1 <= coins[i] <= 2³¹ - 1 
// 0 <= amount <= 10⁴ 
// 
// Related Topics Array Dynamic Programming Breadth-First Search 👍 8692 👎 224


package leetcode.editor.en;

import java.util.Arrays;

public class _322_CoinChange {
    public static void main(String[] args) {
        Solution solution = new _322_CoinChange().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int coinChange(int[] coins, int amount) {
            int[] dp = new int[amount+1];
            Arrays.fill(dp, amount+1);
            dp[0] = 0;
            for (int i = 1; i <= amount; i++) {
                for (int coin : coins) {
                    if (i>=coin) {
                        dp[i] = Math.min(dp[i], dp[i-coin]+1);
                    }
                }
            }
            return dp[amount] == amount +1?-1:dp[amount];
        }


        public int coinChange1(int[] coins, int amount) {
            int[] dp = new int[amount+1];
            for (int i = 1; i <= amount; i++) {
                Integer min = Integer.MAX_VALUE;
                for (int coin : coins) {
                    if (coin>i || dp[i-coin]>min || dp[i-coin]<0) {
                        continue;
                    }
                    min = dp[i - coin];
                }
                if (min == Integer.MAX_VALUE) {
                    dp[i] = -1;
                }else {
                    dp[i] = min+1;
                }
            }
            return dp[amount];
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}